منابع مشابه
Weights in block iterative methods
In this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.When the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. Additionally for linear feasibil...
متن کاملProjected non-stationary simultaneous iterative methods
In this paper, we study Projected non-stationary Simultaneous It-erative Reconstruction Techniques (P-SIRT). Based on algorithmic op-erators, convergence result are adjusted with Opial’s Theorem. The advantages of P-SIRT are demonstrated on examples taken from to-mographic imaging.
متن کاملweights in block iterative methods
in this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.when the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. additionally for linear feasibil...
متن کاملSpectrum optimization in multi-user multi-carrier systems with iterative convex and nonconvex approximation methods
Several practical multi-user multi-carrier communication systems are characterized by a multi-carrier interference channel system model where the interference is treated as noise. For these systems, spectrum optimization is a promising means to mitigate interference. This however corresponds to a challenging nonconvex optimization problem. Existing iterative convex approximation (ICA) methods c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1993
ISSN: 0898-1221
DOI: 10.1016/0898-1221(93)90035-t